Refined bounds on the number of connected compo - nents of sign conditions
نویسنده
چکیده
Let R be a real closed field and Q1, , Ql∈R[X1, ,Xk] such that for each i, 1≤ i≤ l, deg (Qi)≤di. For 1≤ i≤ l, denote by Qi= {Q1, , Qi}, Vi the real variety defined by Qi, and ki an upper bound on the real dimension of Vi (by convention V0=R and k0= k). Suppose also that 2≤ d1≤ d2≤ 1 k+1 d3≤ 1 (k+1) d4≤ ≤ 1 (k+1)l−3 dl−1≤ 1 (k+1)l−2 dl, and that l ≤ k. We prove that the number of semi-algebraically connected components of Vl is bounded by O(k) (
منابع مشابه
Connected Component Based Word Spotting on Persian Handwritten image documents
Word spotting is to make searchable unindexed image documents by locating word/words in a doc-ument image, given a query word. This problem is challenging, mainly due to the large numberof word classes with very small inter-class and substantial intra-class distances. In this paper, asegmentation-based word spotting method is presented for multi-writer Persian handwritten doc-...
متن کاملIi Classical and Nonclassical Compo - Nents of Quantum Observables 3
The Heisenberg inequality ∆X∆P ≥ h̄/2 can be replaced by an exact equality, for suitably chosen measures of position and momentum uncertainty, which is valid for all wavefunctions. The significance of this “exact” uncertainty relation is discussed, and results are generalised to angular momentum and phase, photon number and phase, time and frequency, and to states described by density operators....
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملRefined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P,Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk be the real algebraic variety defined by the polynomials in Q and suppose that the real dimension of V is bounded by k′. We prove that the number of semi-algebraically connected components of the realizations of all realizabl...
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کامل